On the Calculation of the Terminal Polynomial of a Star-like Graph
نویسنده
چکیده
The terminal matrix is the distance matrix between all pairs of valence one vertices of a given graph and the terminal polynomial is the characteristic polynomial of the terminal matrix. Star-like graphs are connected graphs with at most one vertex of degree 3 d . The recursive formula that calculates the terminal polynomial of a star-like graph is given. Particularly, the formula that calculates the constant term in the terminal polynomial is given in closed form.
منابع مشابه
On Second Atom-Bond Connectivity Index
The atom-bond connectivity index of graph is a topological index proposed by Estrada et al. as ABC (G) uvE (G ) (du dv 2) / dudv , where the summation goes over all edges of G, du and dv are the degrees of the terminal vertices u and v of edge uv. In the present paper, some upper bounds for the second type of atom-bond connectivity index are computed.
متن کاملOmega and PIv Polynomial in Dyck Graph-like Z(8)-Unit Networks
Design of crystal-like lattices can be achieved by using some net operations. Hypothetical networks, thus obtained, can be characterized in their topology by various counting polynomials and topological indices derived from them. The networks herein presented are related to the Dyck graph and described in terms of Omega polynomial and PIv polynomials.
متن کاملSemistar dimension of polynomial rings and Prufer-like domains
Let $D$ be an integral domain and $star$ a semistar operation stable and of finite type on it. We define the semistar dimension (inequality) formula and discover their relations with $star$-universally catenarian domains and $star$-stably strong S-domains. As an application, we give new characterizations of $star$-quasi-Pr"{u}fer domains and UM$t$ domains in terms of dimension inequal...
متن کاملSome New Results On the Hosoya Polynomial of Graph Operations
The Wiener index is a graph invariant that has found extensive application in chemistry. In addition to that a generating function, which was called the Wiener polynomial, who’s derivate is a q-analog of the Wiener index was defined. In an article, Sagan, Yeh and Zhang in [The Wiener Polynomial of a graph, Int. J. Quantun Chem., 60 (1996), 959969] attained what graph operations do to the Wiene...
متن کاملOn the tutte polynomial of benzenoid chains
The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.
متن کامل